Protecting local access telecommunications networks: Toward a minimum-cost solution

The problem of designing fibre-optic networks for local-access telecommunications generates (at least) three non-trivial subproblems. In the first of these subproblems one must determine how many fibre-optic cables (fibres) are required at either end of a street. In the next subproblem a minimum-cost network must be designed to support the fibres. The network must also provide distinct paths from either end of the street to the central exchange(s). Finally, the fibre-optic cables must be placed in protective covers. These covers are available in a number of different sizes, allowing some flexibility when covering each section of the network. In this paper we describe a dynamic programming (DP) formulation for finding a minimum-cost (protective) covering for the network (the third of the subproblems). This problem is a generalised set covering problem with side constraints and is further complicated by the introduction of fixed and variable welding costs. The DP formulation selects covers along each arc (in the network), but cannot exactly model the fixed costs and so does not guarantee optimality. We also describe an integer programming (IP) formulation for assessing the quality of the DP solutions. The cost of the networks constructed by the IP model is less than those designed using the DP model, but the saving is not significant for the problems examined (less than 0.1%). This indicates that the DP model will generally give very good solutions. Furthermore, as the problem dimensions grow, DP gives significantly better solution times than IP.     

用Delphi实现快速删除TList的批连续结点算法的探讨

在编制遥测数据处理软件的过程中，面对大量的测试数据，经常需要编写高效率的数据过滤器。本文讨论了一种通过采用跨单元、跨类访问Delphi类的私有域的方法实现快速删除TList批连续结点的新算法，并通过测试结果得到验证。     

结构化编程实现Sniffer

随着各高校校园网络规模的不断扩大和各种应用的急剧增加,各种新的网络问题也在不断出现。Sniffer是网络管理员进行网络管理的有效工具,可以有效地对网络进行实时监控,及时发现网络中存在的各种问题。本文首先介绍了Sniffer的工作原理,其次给出了实现Sniffer功能的编程流程图,并用C语言给出了编程所需的关键代码。     

高校设备管理系统的设计与实现

运用Delphi 6和MS SQL Server 2000,在需求分析、功能模块划分、数据库模式分析的基础,设计了数据库结构并开发了高校的设备管理系统。该系统对设备管理中的需求计划、选型、购置、库存、使用、维修、更新及报废等全过程信息进行记录,同时兼顾资金计划和合同管理,使实物与财务有机结合,并为用户提供详尽准确的统计信息和便捷的管理手段。     

一种实现最佳用户检测的非线性优化神经网络

本文提出并讨论了实现码分多址（CDMA）系统上最佳多用户检测（MUD）的一种神经网络方法。该方法通过将最佳多用户检测视为非线性优化组合问题，利用神经网络能有效求解非线性优化问题的优势，导出了一种非线性优化神经网络来实现最佳多用户检测，理论分析和计算机模拟表明，所提出的神经网络具有可实时应用的动态性能和较传统方法优越得多的误码率性能和抗多址干扰的性能。     

R-Calculus for ELP:An Operational Approach to Knowledge Base Maintenance

Sme concepts used in knowledge base maintenace,such as sequence,new law,user‘s rejection and reconstructions of a knowledge base,are first introduced,and then a framework for extended logic programming(ELP)is given,where an extended logic program is equivalent to a knowledge base.A transition system called R-calculus for ELP is provided.For a given knowledge base and a user‘s rejection,the R-calculus for ELP will deduce best revisions of the base.The soundness and the completeness of the R-calculus for ELP are proved,and the R-calculus for ELP is implemented in Prolog.In addition,the research is compared with other relevant work.     

小型过程控制器中编程功能的实现

根据中小规模生产设备过程控制的特点,提出了生产工艺程序在过程控制器中应具有的一般形式,并详细分析如何使小型过程控制器具有编辑这种工艺程序的功能。     

证券组合的快车道问题研究

本文建立了新的证券组合最优控制模型，分析了证券市场长期投资过程中证券组合的快车道问题；提出了隐式规划的模拟退火方法，进行了快车道的仿真，这对于证券市场长期稳定运行和投资具有实际意义。     

基于微机的PUMA262机器人的离线编程系统

本文论述了一个离线编程系统开发的全过程，包括系统的设计和该软件的核心技术，ＰＵＭＡ机器人的运动学动力分析与仿真，机器人与微机的接口技术及ＮＵＲＢＳ高级曲线的路径规划方法等。     

Error in the UNITY substitution rule for subscripted operators

UNITY, introduced by Chandy and Misra [ChM88], is a programming logic intended to reason about temporal properties of distributed programs. Despite the fact that UNITY does not have the full power of, for example, linear temporal logic, it enjoys popularity due to its simplicity.There was however a serious problem with the Substitution Rule. The logic is incomplete without the rule, and with the rule it is inconsistent.